Convex hull ranking algorithm for multi-objective evolutionary algorithms
نویسندگان
چکیده
Convex hull; Non-dominated solutions; Multi-objective evolutionary algorithms; Complexity; Ranking procedure. Abstract Due tomany applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and their complexity depends on finding non-dominated fronts, this paper introduces a new method for ranking the solutions of an evolutionary algorithm’s population. First, we investigate the relation between the convex hull and non-dominated solutions, and discuss the complexity time of the convex hull and non-dominated sorting problems. Then, we use convex hull concepts to present a new ranking procedure for multi-objective evolutionary algorithms. The proposed algorithm is very suitable for convexmulti-objective optimization problems. Finally,we apply thismethod as an alternative ranking procedure toNSGA-II for non-dominated comparisons, and test it using some benchmark problems. © 2012 Sharif University of Technology. Production and hosting by Elsevier B.V. All rights reserved.
منابع مشابه
Using composite ranking to select the most appropriate Multi-Criteria Decision Making (MCDM) method in the optimal operation of the Dam reservoir
In this study, the performance of the algorithms of whale, Differential evolutionary, crow search, and Gray Wolf optimization were evaluated to operate the Golestan Dam reservoir with the objective function of meeting downstream water needs. Also, after defining the objective function and its constraints, the convergence degree of the algorithms was compared with each other and with the absolut...
متن کاملMulti-objective evolutionary algorithms for a preventive healthcare facility network design
Preventive healthcare aims at reducing the likelihood and severity of potentially life-threatening illnesses by protection and early detection. In this paper, a bi-objective mathematical model is proposed to design a network of preventive healthcare facilities so as to minimize total travel and waiting time as well as establishment and staffing cost. Moreover, each facility acts as M/M/1 queuin...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAutonomous Underwater Vehicle Hull Geometry Optimization Using a Multi-objective Algorithm Approach
Abstarct In this paper, a new approach to optimize an Autonomous Underwater Vehicle (AUV) hull geometry is presented. Using this methode, the nose and tail of an underwater vehicle are designed, such that their length constraints due to the arrangement of different components in the AUV body are properly addressed. In the current study, an optimal design for the body profile of a torpedo-shaped...
متن کاملConvex Hull-Based Multi-objective Genetic Programming for Maximizing ROC Performance
Receiver operating characteristic (ROC) is usually used to analyse the performance of classifiers in data mining. An important ROC analysis topic is ROC convex hull(ROCCH), which is the least convex majorant (LCM) of the empirical ROC curve, and covers potential optima for the given set of classifiers. Generally, ROC performance maximization could be considered to maximize the ROCCH, which also...
متن کامل